Solving Non-linear Sparse Equation Systems over GF (2) Using Graphs
نویسنده
چکیده
Non-linear equation systems arise in many problems. It is well known that solving such systems is NP-complete in general. In this paper we present a method for solving sparse non-linear equation systems, using ideas from graph based iterative decoding techniques. The motivation for doing this comes from cryptanalysis, and we try to attack DES using our method. We show that it is easy to break three rounds of DES, and that four rounds also can be attacked by guessing some of the key bits.
منابع مشابه
Solving Homogeneous Linear Equations over Gf(2) via Block Wiedemann Algorithm
We propose a method of solving large sparse systems of homogeneous linear equations over GF(2), the field with two elements. We modify an algorithm due to Wiedemann. A block version of the algorithm allows us to perform 32 matrix-vector operations for the cost of one. The resulting algorithm is competitive with structured Gaussian elimination in terms of time and has much lower space requiremen...
متن کاملChallenges in Solving Large Sparse Linear Systems over Finite Fields∗
This talk outlines how very large, sparse linear systems arise in the solution of problems of interest in computational number theory and public-key cryptography, such as the integer factorization and discrete logarithm problems. The linear systems are over finite fields, often the field GF(2) of two elements. We describe some algorithms for solving large sparse linear systems over GF(2), and c...
متن کاملAccelerating Iterative SpMV for Discrete Logarithm Problem using GPUs
In the context of cryptanalysis, computing discrete logarithms in large cyclic groups using index-calculus-based methods, such as the number field sieve or the function field sieve, requires solving large sparse systems of linear equations modulo the group order. Most of the fast algorithms used to solve such systems — e.g., the conjugate gradient or the Lanczos and Wiedemann algorithms — itera...
متن کاملImplicant based solver for XOR Boolean linear systems
An approach is presented for solving linear systems of equations over the Boolean algebra B0 = {0,1} based on implicants of Boolean functions. The approach solves for all implicant terms which represent all solutions of the system. Traditional approach to solving such linear systems is to consider them over the field GF(2) and solve either by Gaussian elimination or Lanczos methods. One of the ...
متن کاملEfficient Decomposition of Dense Matrices over GF(2)
In this work we describe an efficient implementation of a hierarchy of algorithms for the decomposition of dense matrices over the field with two elements (F2). Matrix decomposition is an essential building block for solving dense systems of linear and non-linear equations and thus much research has been devoted to improve the asymptotic complexity of such algorithms. In this work we discuss an...
متن کامل